Cooperative TSP

Cooperative TSP

In this paper we introduce and study cooperative variants of the Traveling Salesperson Problem. In these problems a salesperson has to make deliveries to customers who are willing to help in the process. Customer cooperativeness may be manifested in several modes: they may assist by approaching the salesperson, by reselling the goods they purchased to other customers, or by doing both. Several ...

Euclidean TSP

TSP Art

Bosch and Herman recently described how to use the traveling salesman problem (TSP) to construct a continuous line drawing based on a user-supplied image. They create a distribution of “cities” that approximates the darkness of the source image, and pass the cities to a heuristic TSP solver. We discuss their method and present alternative algorithms for city distribution that yield more attract...

Bio-inspired Algorithms for TSP and Generalized TSP

The Traveling Salesman Problem (TSP) is to find a Hamiltonian tour of minimal length on a fully connected graph. The TSP is a NP-Complete, and there is no polynomial algorithm to find the optimal result. Many bio-inspired algorithms has been proposed to address this problem. Generally, generic algorithm (GA), ant colony optimization (ACO) and particle swarm optimization (PSO) are three typical ...

Particle swarm optimization-based algorithms for TSP and generalized TSP

A novel particle swarm optimization (PSO)-based algorithm for the traveling salesman problem (TSP) is presented. An uncertain searching strategy and a crossover eliminated technique are used to accelerate the convergence speed. Compared with the existing algorithms for solving TSP using swarm intelligence, it has been shown that the size of the solved problems could be increased by using the pr...